package Array;

public class item33 {
    public static int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] == target)
                return mid;
            if (nums[left]<=nums[mid])
            {
                if(nums[mid]>target&&target>=nums[left])
                {
                    right = mid-1;
                }
                else
                    left = mid+1;
            }
            else
            {
                if(nums[mid]<target&&target<=nums[right])
                {
                    left = mid+1;
                }
                else
                {
                    right = mid-1;
                }
            }

        }

        return -1;
    }

    public static void main(String[] args) {
        int []num = {3,1};
        search(num,1);

    }
}
